منابع مشابه
BloodPressure in the Unanesthetized Rat
Methods of indirectly determining blood pressure in the rat are reviewed and their drawbacks noted. A new method is described which has the advantage of objectivity and provides permanent graphic record of each determination. The end point used is the reappearance of pulsation in the foot distal to a slowly deflating leg cuff. Application of the method is described and its use compared with tai...
متن کاملترجمه و تحقیق کتاب an introduction to the history of mysticism
پایان نامه ی ارائه شده ترجمه ی کتاب «an introduction to the history of mysticism» نوشته ی مارگارت اسمیت که وی پژوهشگر، خاورشناس و محقق برجسته ی تصوف و عرفان می باشد. موضوع اساسی و مهم این کتاب عرفان در ادیان مختلف است. نویسنده در ابتدا این کلمه را ریشه یابی کرده و سپس تعریفی از آن ارائه داده و آن را در ادیان مختلف مورد بحث قرار داده است و در هر فصل کتاب به معرفی عرفای آن دین یا عصر خاصی پرداخته...
15 صفحه اولinvestigating the relationship between ambiguity tolerance and willingness to translate of iranian prospective english translators: an sem revalidation study
cognitive studies of translation process have recently been awarded a great deal of attention. there exists a psychological angle to almost all translation activities. the present study, thus, deals with analysing the relationships between iranian prospective translators tolerance for ambiguity (ta) and their willingness to translate (wtt). the research was conducted as a mixed methods study, d...
On computing the general Narumi-Katayama index of some graphs
The Narumi-Katayama index was the first topological index defined by the product of some graph theoretical quantities. Let $G$ be a simple graph with vertex set $V = {v_1,ldots, v_n }$ and $d(v)$ be the degree of vertex $v$ in the graph $G$. The Narumi-Katayama index is defined as $NK(G) = prod_{vin V}d(v)$. In this paper, the Narumi-Katayama index is generalized using a $n$-ve...
متن کاملSome new bounds on the general sum--connectivity index
Let $G=(V,E)$ be a simple connectedgraph with $n$ vertices, $m$ edges and sequence of vertex degrees$d_1 ge d_2 ge cdots ge d_n>0$, $d_i=d(v_i)$, where $v_iin V$. With $isim j$ we denote adjacency ofvertices $v_i$ and $v_j$. The generalsum--connectivity index of graph is defined as $chi_{alpha}(G)=sum_{isim j}(d_i+d_j)^{alpha}$, where $alpha$ is an arbitrary real<b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the American Medical Association
سال: 1911
ISSN: 0002-9955
DOI: 10.1001/jama.1911.04260070366003